Pursuit - Evasion Voronoi Diagrams in 1 ∗
نویسندگان
چکیده
We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader’s region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path from its starting point without encountering a pursuer along the way. The evader and the pursuers must obey their start time and speed constraints, and cannot go through obstacles. The partition of the plane into the evader’s region and the remaining pursuers’ region is called the pursuit-evasion Voronoi diagram. We study pursuit-evasion Voronoi diagrams for the 1 metric. We show that the complexity of the diagram is O((n+m)(mn+m)) and that it can be calculated in
منابع مشابه
Pursuit/Evasion Voronoi Diagrams∗
In typical 2D Voronoi diagrams, the distance from a site to a point in the plane is unaffected by the existance of other sites. In 2D pursuit/evasion Voronoi diagrams, the distance from an evader to a point is the length of the shortest path to that point that avoids all pursuers. Since pursuers can move, the paths that evaders follow to reach certain points in the plane can be quite complicate...
متن کاملPursuit - Evasion Voronoi Diagrams in l
We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader’s region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path...
متن کاملCooperative pursuit with Voronoi partitions
This work considers a pursuit-evasion game in which a number of pursuers are attempting to capture a single evader. Cooperation among multiple agents can be difficult to achieve, as it may require the selection of actions in the joint input space of all agents. This work presents a decentralized, real-time algorithm for cooperative pursuit of a single evader by multiple pursuers in bounded, sim...
متن کاملLocal differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions
This paper studies local properties of Voronoi diagrams of sets of disjoint compact convex sites in R. It is established that bisectors are C surfaces and trisectors are C curves, and that as a point moves along a trisector its clearance sphere develops monotonically (Lemma 2.4). This monotonicity property is useful in establishing the existence of Voronoi vertices bounding edges in certain sit...
متن کاملVoronoi Diagrams in Linear Time ∗
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....
متن کامل